منابع مشابه
An experimental assessment of minimum mapping unit size
Land-cover (LC) maps derived from remotely sensed data are often presented using a minimum mapping unit (MMU) to characterize a particular landscape theme of interest. The choice of an MMU that is appropriate for the projected use of a classification is an important consideration. The objective of this experiment was to determine the effect of MMU on a LC classification of the Neuse River Basin...
متن کاملAn Experimental Study of Evolutionary Product-Unit Neural Network Algorithm
This paper aims to obtain empirical information about the behavior of an Evolutionary Product-Unit Neural Network (EPUNN) in different scenarios. To achieve this, an extensive evaluation was conducted on 21 data sets for the classification task. Then, we evaluated EPUNN on eleven noisy data sets, on sixteen imbalanced data sets, and on ten missing values data sets. As a result of this evaluatio...
متن کاملMarkov Paging
This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the fault-rate of paging algorithms. We first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain. Next, we address the problem of devising a paging str...
متن کاملParavirtualized Paging
Conceptually, fast server-side page cache storage could dramatically reduce paging I/O. In this workshop extended abstract, we speculate how such a device might be used, then show how it can be implemented virtually in a hypervisor. We then introduce hcache (pronounced “aitch-cash”), our prototype implementation built on the Xen hypervisor and utilized by slightly modified Linux paravirtualized...
متن کاملFinely-Competitive Paging
We construct an online algorithm for paging that achieves an O(r + log k) competitive ratio when compared to an offline strategy that is allowed the additional ability to “rent” pages at a cost of 1=r. In contrast, the competitive ratio of the Marking algorithm for this scenario is O(r log k). Our algorithm can be thought of in the standard setting as having a “fine-grained” competitive ratio, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1971
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/14.1.55